Expected Time and Linear Space

نویسندگان

  • Yijie Han
  • Mikkel Thorup
چکیده

We present a randomized algorithm sorting n integers in O(n p log logn) expected time and linear space. This improves the previous O(n log logn) bound by Anderson et al. from STOC’95. As an immediate consequence, if the integers are bounded by U , we can sort them in O(n p log logU) expected time. This is the first improvement over the O(n log logU) bound obtained with van Emde Boas’ data structure from FOCS’75. At the heart of our construction, is a technical deterministic lemma of independent interest; namely, that we split n integers into subsets of size at most p n in linear time and space. This also implies improved bounds for deterministic string sorting and integer sorting without multiplication.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterization of $2times 2$ full diversity space-time codes and inequivalent full rank spaces

‎In wireless communication systems‎, ‎space-time codes are applied to encode data when multiple antennas are used in the receiver and transmitter‎. ‎The concept of diversity is very crucial in designing space-time codes‎. ‎In this paper‎, ‎using the equivalent definition of full diversity space-time codes‎, ‎we first characterize all real and complex $2times 2$ rate one linear dispersion space-...

متن کامل

Theoretical Analysis of Polarization Rotation angle in Dual Reflector Antenna

Because of special structure, a dual reflector antenna has beam rotation capability in azimuth and elevation directions. In this structure, the antenna beam can be placed in any point in the space by mechanical movement of twist reflector which it is the most important ability of the antenna. Due to the antenna structure, if the polarization of incident wave is linear, it is expected that the p...

متن کامل

Optimizing Integer Sorting in O(n log log n) Expected Time in Linear Space

The traditional algorithms for integer sorting give a bound of O(n log n) expected time without randomization and O(n) with randomization. Recent researches have optimized lower bound for deterministic algorithms for integer sorting [4, 5, 7]. We present a fast deterministic algorithm for integer sorting in linear space. The algorithm discussed in this paper sorts n integers in the range {0, 1,...

متن کامل

Admissibility analysis for discrete-time singular systems with time-varying delays by adopting the state-space Takagi-Sugeno fuzzy model

This paper is pertained with the problem of admissibility analysis of uncertain discrete-time nonlinear singular systems by adopting the state-space Takagi-Sugeno fuzzy model with time-delays and norm-bounded parameter uncertainties. Lyapunov Krasovskii functionals are constructed to obtain delay-dependent stability condition in terms of linear matrix inequalities, which is dependent on the low...

متن کامل

The Relationship between Perception of Time, Fear, Expected Anxiety and Hope in Pregnant Women and their Partners

The aim of the present study was to investigate the relationship between perception of time and expected anxiety as well as perception of time and fear and hope in pregnant women and their partners. The population was all pregnant women and their partners who had visited a gynecologist in the city of Karaj, in Iran at 2015-2016. From this population, 120 participants (60 couples) were selected ...

متن کامل

A New Multi-objective Model for Multi-mode Project Planning with Risk

The purpose of this problem is to choose a set of project activities for crashing, in a way that the expected project time, cost and risk are minimized and the expected quality is maximized. In this problem, each project activity can be performed with a specific executive mode. Each executive mode is characterized with four measures, namely the expected time, cost, quality and risk. In this pap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001